Benchmarking different global optimisation techniques for preliminary space trajectory design
نویسندگان
چکیده
In this paper we describe a number of global optimisation problems connected to spacecraft trajectory design. Each problem is coded in the form of a blackbox objective function accepting, as inputs, the decision vector and returning the objective function and the constraint evaluation. The code is made available on line as a challenge to the community to develop performing algorithms able to solve each of the problems proposed in an efficient manners. All the problems proposed draw inspiration from real trajectory problems, ranging from Cassini to Rossetta to Messenger to possible future missions. As a start we also report the results coming from applying standard global optimisation algorithm to each of the problem. We consider Differential Evolution, Particle Swarm Optimisation, Genetic Algorithm, Adaptive Simulated Annealing and GLOBAL. As all these standard implementations seem to fail to solve more complex problems, we conclude the paper suggesting a cooperative approach between the different algorithm showing performance
منابع مشابه
An Efficient Pruning Technique for the Global Optimisation of Multiple Gravity Assist Trajectories
With application to the specific problem of multiple gravity assist trajectory design, a deterministic search space pruning algorithm is developed that displays both polynomial time and space complexity. This is shown empirically to achieve search space reductions of greater than six orders of magnitude, thus reducing significantly the complexity of the subsequent optimisation.
متن کامل7 Global Optimization and Space Pruning for Spacecraft Trajectory Design
Global optimization algorithms and space pruning methods represent a recent new paradigm for spacecraft trajectory design. They promise an automated and unbiased search of different trajectory options, freeing the final user from the need for caring about implementation details. In this chapter we provide a unified framework for the definition of trajectory problems as pure mathematical optimiz...
متن کاملDesign of Robust Space Trajectories
In this paper we apply a novel black-box optimisation algorithm to the Global Trajectory optimisation Problem provided by the European Space Agency (ESA). The proposed algorithm, called SAGES, has been applied to instances of seven trajectory design problems, comparing it with the known best solutions. The numerical results show clear improvements on the majority of the problems and, in order t...
متن کاملMultiple Gravity Assist Trajectories
Multiple gravity assist (MGA) trajectories represent a particular class of space trajectories in which a spacecraft exploits the encounter with one or more celestial bodies to change its velocity vector; they have been essential to reach high v targets with low propellant consumption. The search for optimal transfer trajectories can be formulated as a mixed combinatorial-continuous global opti...
متن کاملRadar Waveform Optimisation as a Many-Objective Application Benchmark
This paper introduces a real, unmodified Many-Objective optimisation problem for use in optimisation algorithm benchmarking. The radar waveform design problem has 9 objectives and an integer decision space that can be scaled from 4 to 12 decision variables. Proprietary radar waveform design software has been encapsulated in a fast and portable form to facilitate research groups in studying high...
متن کامل